resolution refutation

英 [ˌrezəˈluːʃn ˌrefjuˈteɪʃn]

美 [ˌrezəˈluːʃn ˌrefjuˈteɪʃn]

网络归结反驳; 归结反演

As we know, for any formula in MU ( 1), there is a corresponding ( 1, 1)-resolution refutation.
我们已经知道，对于任意一个MU（1）公式对应一个（1，1）-消解。
This paper also makes a relatively profound inquiry into the basic algorithm of AI, the means ends analysis, and seeks to prove the effectiveness of difference produced by a resolution refutation tree.
同时，本文对AI的基本算法&中间结局分析法作了较深入的探讨，证明了用归结反演树产生差别的有效性。
A SAT algorithm can determine whether any given CNF formula is satisfiable in limited time. DPLL algorithm and resolution refutation are two key methods resolving SAT problems.
一个SAT算法能在有限时间内判定任意给定的CNF公式是否可满足，DPLL算法和消解反驳法是判定SAT问题的两个重要方法。
The method of resolution is universally effective to prove inner theorems of propositional logic automatically, but current one is a refutation procedure.
消解算法对命题逻辑定理自动证明是普遍能行的，但现行消解证明只能归属于反证法。
New methods of logic inference of Petri net based on resolution refutation
基于归结反演的Petri网推理新方法